翻訳と辞書 Words near each other ・ Polyortha ・ Polyortha atroperla ・ Polyortha biezankoi ・ Polyortha bryographa ・ Polyortha bryometalla ・ Polyortha chiriquitana ・ Polyortha chlamydata ・ Polyortha clarkeana ・ Polyortha euchlorana ・ Polyortha evestigana ・ Polyortha glaucotes ・ Polynomial and rational function modeling ・ Polynomial arithmetic ・ Polynomial basis ・ Polynomial chaos ・ Polynomial code ・ Polynomial conjoint measurement ・ Polynomial decomposition ・ Polynomial delay ・ Polynomial Diophantine equation ・ Polynomial expansion ・ Polynomial function theorems for zeros ・ Polynomial greatest common divisor ・ Polynomial hierarchy ・ Polynomial identity ring ・ Polynomial interpolation ・ Polynomial kernel ・ Polynomial least squares ・ Polynomial lemniscate ・ Polynomial long division Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Polynomial code ： ウィキペディア英語版 Polynomial code In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the ''generator polynomial''). == Definition == Fix a finite field $GF(q)$, whose elements we call ''symbols''. For the purposes of constructing polynomial codes, we identify a string of $n$ symbols $a\_\backslash ldots\; a\_0$ with the polynomial :$a\_x^\; +\; \backslash cdots\; +\; a\_1x\; +\; a\_0.\backslash ,$ Fix integers $m\; \backslash leq\; n$ and let $g(x)$ be some fixed polynomial of degree $m$, called the ''generator polynomial''. The ''polynomial code generated by $g(x)$'' is the code whose code words are precisely the polynomials of degree less than $n$ that are divisible (without remainder) by $g(x)$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Polynomial code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.